'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
     , 0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
     , 0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
     , 0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
     , 0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1))))))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  0^#(1(2(3(4(x1))))) -> c_0(0^#(2(1(3(4(x1))))))
    , 0^#(5(1(2(4(3(x1)))))) -> c_1(0^#(5(2(1(4(3(x1)))))))
    , 0^#(5(2(4(1(3(x1)))))) -> c_2(0^#(1(5(2(4(3(x1)))))))
    , 0^#(5(3(1(2(4(x1)))))) -> c_3(0^#(1(5(3(2(4(x1)))))))
    , 0^#(5(4(1(3(2(x1)))))) -> c_4(0^#(5(4(3(1(2(x1)))))))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.